Connectedness of graphs generated by a random d-process
نویسندگان
چکیده
منابع مشابه
CONNECTEDNESS OF GRAPHS GENERATED BY A RANDOM d-PROCESS
Suppose that a graph process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always at most d . In a previous article, the authors showed that as n → ∞, with probability tending to 1, the result of this process is a d-regular graph. This graph is shown to be connected with probability asymptotic to 1. 2000 Mathemat...
متن کاملConnectedness of Certain Random Graphs
L. Dubins conjectured in 1984 that the graph on vertices {1 , 2 , 3 , . . . } where an edge isdrawn between vertices i and j with probability p i j = λ/max (i , j) independently for each pair iand j is a.s. connected for λ = 1. S. Kalikow and B. Weiss proved that the graph is a.s.connected for any λ > 1. We prove Dubin’s conjecture and show that the graph is a.s. connectedfo...
متن کاملGibbs distributions for random partitions generated by a fragmentation process
In this paper we study random partitions of {1, . . . , n} where every cluster of size j can be in any of wj possible internal states. The Gibbs (n, k, w) distribution is obtained by sampling uniformly among such partitions with k clusters. We provide conditions on the weight sequence w allowing construction of a partition valued random process where at step k the state has the Gibbs (n, k, w) ...
متن کاملConnectivity of random regular graphs generated by the pegging algorithm
We study the connectivity of random d-regular graphs which are recursively generated by an algorithm motivated by a peer to peer network. We show that these graphs are asymptotically almost surely d-connected for any even constant d ≥ 4.
متن کاملOn Connectedness of Graphs
A graph structure is deened on the Weyl groups. We show that these graphs are connected for Weyl groups of type An for n 4. 1. Introduction. We have deened a graph structure on Weyl groups through the root system associated with them. The planarity and the other properties of such graphs has been studied elsewhere (1] and 2]). The motivation for these graphs come from the method employed in pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 2002
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788700003591